package ztttt1;

import java.util.*;
public class Main99 {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        
    }
    //洛谷 深基2.上学迟到
    public static void main4(String[] args){
        Scanner in = new Scanner(System.in);
        double a = in.nextInt();
        double b = in.nextInt();
        int c = (int)Math.ceil(a / b) + 10;
        int h = 7;
        int m = 60;
        while(c >= 60){
            c -= 60;
            h--;
        }
        while(h < 0){
            h += 24;
        }
        m -= c;
        System.out.println(String.format("%02d:%02d",h,m));
    }
    //蓝桥杯2022省A 青蛙过河
    static int n,x;
    public static void main2(String[] args) {
        Scanner sc=new Scanner(System.in);
        int sum=0;
        n=sc.nextInt();
        x=sc.nextInt();
        int[] H=new int[n];
        int[] b=new int[n];
        for (int i=1;i<n;i++){
            H[i]=sc.nextInt();
            sum+=H[i];
            b[i]=sum;
        }
        int left=1,right=n,middle,S=0;
        while(left<=right){
            middle=left+right>>1;
            if (check(middle,b)){
                S=middle;

                right=middle-1;

            }else {
                left=middle+1;

            }

        }
        System.out.println(S);
        sc.close();
    }

    private static boolean check(int middle, int[] b) {
        for (int i=1;i+middle<=n;i++){
            if (b[i+middle-1]-b[i-1]<2*x){
                return false;
            }
        }
        return true;
    }
    //蓝桥杯2014国C 拼接平方数
    public static void main1(String[] args) {
        Scanner in = new Scanner(System.in);
        int a = in.nextInt();
        int b = in.nextInt();
        for(int i = a;i <= b;i++) {
            int num0 = i;
            int num1 = i;
            int n = 10;
            while(num0 > 0){
                num0 = i / n;// 122 12 1
                num1 = i % n;// 5   25 225
                if(doNum(i) && doNum(num0) && doNum(num1)){
                    System.out.println(i);
                    break;
                }
                n *= 10;
            }
        }
    }
    public static boolean doNum(int num){
        if(num == 0){
            return false;
        }
        double n = Math.sqrt(num);
        if(n % 1 == 0){
            return true;
        }
        return false;
    }
}
